Qué (quién) es Bird-Meertens Formalism - definición
CALCULUS FOR DERIVING COMPUTER PROGRAMS FROM SPECIFICATIONS BY A PROCESS OF EQUATIONAL REASONING
Squiggol; Squigol; Bird-Meertens formalism; Bird-Merteens Formalism; Bird-Meertens Formalism; Bird–Meertens Formalism; Homomorphism lemma; List homomorphism lemma; Homomorphism Lemma
Bird-Meertens Formalism
<theory, programming> (BMF) (Or "Squiggol") A calculus for
derivation of functional programs from a specification. It
consists of a set of higher-order functions that operate on
lists including map, fold, scan, filter, inits, tails,
cross product and function composition.
["A Calculus of Functions for Program Derivation", R.S. Bird,
in Res Topics in Fnl Prog, D. Turner ed, A-W 1990 ].
["The Squiggolist", ed Johan Jeuring, published irregularly by
CWI Amsterdam ].
(1995-05-01)
Bird–Meertens formalism
The Bird–Meertens formalism (BMF) is a calculus for deriving programs from specifications (in a functional-programming setting) by a process of equational reasoning. It was devised by Richard Bird and Lambert Meertens as part of their work within IFIP Working Group 2.
Squiggol
Wikipedia
Bird–Meertens formalism
The Bird–Meertens formalism (BMF) is a calculus for deriving programs from specifications (in a functional-programming setting) by a process of equational reasoning. It was devised by Richard Bird and Lambert Meertens as part of their work within IFIP Working Group 2.1.
It is sometimes referred to in publications as BMF, as a nod to Backus–Naur form. Facetiously it is also referred to as Squiggol, as a nod to ALGOL, which was also in the remit of WG 2.1, and because of the "squiggly" symbols it uses. A less-used variant name, but actually the first one suggested, is SQUIGOL.
